On k-partitioning of Hamming Graphs
نویسندگان
چکیده
We consider the graphs Hn a defined as the Cartesian products of n complete graphs with a vertices each. Let an edge cut partition the vertex set of a graph into k subsets A1, . . . , Ak with ||Ai| − |Aj || ≤ 1. We consider the problem of determining the minimal size of such a cut for the graphs defined above and present bounds and asymptotic results for some specific values of k.
منابع مشابه
On Bounds for the k-Partitioning of Graphs
Let an edge cut partition the vertex set of a graph into k disjoint subsets A1, . . . , Ak with ||Ai| − |Aj || ≤ 1. We consider the problem of determining the minimal size of such a cut for a given graph. For this we introduce a new lower bound method which is based on the solution of an extremal set problem and present bounds for some graph classes based on Hamming graphs.
متن کاملIsometric embeddings in Hamming graphs
The results presented in this paper are parts of my doctoral thesis [ 193; the algorithm and some of the characterizations in Section 7 have been introduced in [ 181. Motivation for isometric embeddings into Hamming graphs has come from communication theory (Graham and Pollak [ 121) an-d linguistics (Firsov 1181). Isometric subgraphs of Hamming graphs also appear in biology as “quasi-species” (...
متن کاملDISTANCE k COLORINGS OF HAMMING GRAPHS
A coloring of the vertices of a graph G is a distance k coloring of G if and only if any two vertices lying on a path of length less than or equal to k are given different colors. Hamming graphs are Cartesian (or box) products of complete graphs. In this paper, we will consider the interaction between coding theory and distance k colorings of Hamming graphs.
متن کاملOn the Acyclic Chromatic Number of Hamming Graphs
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum number k such that G has an acyclic coloring with k colors. In this paper, acyclic colorings of Hamming graphs, products of complete graphs, are considered.
متن کاملHamming polynomials and their partial derivatives
Hamming graphs are Cartesian products of complete graphs and partial Hamming graphs are their isometric subgraphs. The Hamming polynomial h(G) of a graph G is introduced as the Hamming subgraphs counting polynomial. Kk-derivates ∂kG (k ≥ 2) of a partial Hamming graph are also introduced. It is proved that for a partial Hamming graph G, ∂h(G) ∂xk = h(∂kG). A couple of combinatorial identities in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 95 شماره
صفحات -
تاریخ انتشار 1999